Oblivious Deadlock-Free Routing in a Faulty Hypercube
نویسندگان
چکیده
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parallel system, some processors are bound to fail, disrupting message routing. Second, one must avoid deadlock configurations in which messages permanently block one another. We present an efficient, oblivious, and deadlock-free routing algorithm for the hypercube. The algorithm tolerates a large number of faults in a worst-case configuration.
منابع مشابه
On Deadlock-free Multicasting in Hypercubes with Faulty Links
This paper presents a deadlock-free algorithm for multicast routing in a faulty hypercube when some of the links have failed. Wormhole routing is assumed for message communication and the number of faulty links is assumed to be fewer than the dimension of the hypercube to ensure the faulty network is not segmented. The performance of the algorithm is analyzed through simulation experiments whic...
متن کاملDeadlock - Free Routing in a Faulty Hypercube
In massively parallel computers, processors are often connected in a hypercube configuration. Each vertex in the hypercube represents a processor, and each edge represents a communication link. One problem in such a system is avoiding deadlock, a state where there is a cycle of processors, each waiting on the next indefinitely. A second problem is that in a system with many processors, some are...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کاملMinimal, deadlock-free routing in hypercubic and arbitrary networks
In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buuers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks includin...
متن کاملAdaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999